N-ary Speculative Computation of Simulated Annealing on the AP1000 Massively Parallel Multiprocessor
نویسنده
چکیده
Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its usage for realistic problem size, however, has been limited by the long execution time due to its sequential nature. This report presents a practical approach to synchronous simulated annealing for massively parallel distributed-memory multiprocessors. We use an n-ary speculative tree to execute n different iterations in parallel on n processors, called Generalized Speculative Computation (GSC). Execution results of the 100to 500-city Traveling Salesman Problems on the AP1000 massively parallel multiprocessor demonstrate that the GSC approach can be an effective method for parallel simulated annealing as it gave over 20-fold speedup on 100 processors.
منابع مشابه
Satis ability Test with Synchronous Simulated Annealing on the Fujitsu AP
Solving the hard Satissability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially diicult due to the ratio of clauses to variables. This report presents a parallel synchronous simulated annealing method for solving the Random L-SAT Problem on a large-scale distributed-memory multiprocessor. In particular, we use a parallel synchrono...
متن کاملParallel Satisfiability Test with Synchronous Simulated Annealing on Distributed-Memory Multiprocessor
Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially difficult due to the ratio of clauses to variables. This report presents a practical approach to solving the Random L-SAT Problem on a large-scale distributed-memory multiprocessor. In particular, we use a parallel synchronous simulated annealing proc...
متن کاملSatisfiability Test with Synchronous Simulated Annealing on the Fujitsu APlOOO Massively-Parallel Multiprocessor
Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially difficult due to the ratio of clauses to variables. This report presents a parallel synchronous simulated annealing method for solving the Random L-SAT Problem on a large-scale distributed-memory multiprocessor. In particular, we use a parallel synchr...
متن کاملAn evaluation of parallel simulated annealing strategies with application to standard cell placement
Simulated annealing, a methodology for solving combinatorial optimization problems, is a very computationally expensive algorithm, and as such, numerous researchers have undertaken efforts to parallelize it. In this paper, we investigate three of these parallel simulated annealing strategies when applied to standard cell placement, specifically the TimberWolfSC placement tool. We have examined ...
متن کاملImplementing Ml on the Fujitsu Ap1000
The CAP ML project seeks to develop a version of ML that is suitable for use on a distributed memory multiprocessor architecture such as the Fujitsu AP1000. Language extensions are proposed that have been developed in conjunction with a programmming methodology that is appropriate to that of a massively parallel computer whilst retaining a functional style. The implementation, which is based on...
متن کامل